Uniform Edge Distribution in Hypergraphs is Hereditary
نویسندگان
چکیده
منابع مشابه
Uniform Edge Distribution in Hypergraphs is Hereditary
Let α ∈ (0, 1), l ≥ 2 and let Hn be an l-graph on n vertices. Hn is (α, ξ)-uniform if every ξn vertices of Hn span (α± ξ) ( ξn l ) edges. Our main result is the following. For all δ̃, there exist δ, r, n0 such that, if n > n0 and H n is (α, δ)-uniform, then all but exp{−r/20} ( n r ) r-sets of vertices induce a subhypergraph that is (α, δ̃)-uniform. We also present the following application. Let ...
متن کاملColoring Uniform Hypergraphs with Small Edge Degrees
The degree of an edge e in a hypergraph G is the number of other edges of G intersecting e, and the maximum edge degree of G is the maximum over the degrees of its edges. A natural question is: Which bound on the maximum edge degree of an r-uniform hypergraph G provides that G is k-colorable? The classical result in this direction belongs to Erdős and Lovász. In their seminal paper [2] (where t...
متن کاملRealizing degree sequences with k-edge-connected uniform hypergraphs
An integral sequence d = (d1, d2, . . . , dn) is hypergraphic if there is a simple hypergraph H with degree sequence d, and such a hypergraph H is a realization of d. A sequence d is r-uniform hypergraphic if there is a simple r-uniform hypergraph with degree sequence d. Similarly, a sequence d is r-uniformmulti-hypergraphic if there is an r-uniformhypergraph (possibly with multiple edges) with...
متن کاملEdge coloring complete uniform hypergraphs with many components
Let H be a hypergraph. For a k-edge coloring c : E(H) → {1, . . . , k} let f(H, c) be the number of components in the subhypergraph induced by the color class with the least number of components. Let fk(H) be the maximum possible value of f(H, c) ranging over all k-edge colorings of H . If H is the complete graph Kn then, trivially, f1(Kn) = f2(Kn) = 1. In this paper we prove that for n ≥ 6, f3...
متن کاملEdge intersection graphs of linear 3-uniform hypergraphs
Let L3 be the class of edge intersection graphs of linear 3-uniform hypergraphs. The problem of recognizing G ∈ L3 is NP-complete. Denote by δALG the minimal integer such that the problem ”G ∈ L3 ” is polynomially solvable in the class of graphs G with the minimal vertex degree δ(G) ≥ δALG and by δFIS the minimal integer such that L3 can be characterized by a finite list of forbidden induced su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2004
ISSN: 1077-8926
DOI: 10.37236/1808